Construction of Minimum Connected Dominating Set in 3-Dimensional Wireless Network
نویسندگان
چکیده
Connected Dominating Set (CDS) has been a well known approach for constructing a virtual backbone to alleviate the broadcasting storm in wireless networks. Previous literature modeled the wireless network in a 2-dimensional plane and looked for the approximated Minimum CDS (MCDS) distributed or centralized to construct the virtual backbone of the wireless network. However, in some real situations, the wireless network should be modeled as a 3-dimensional space instead of 2-dimensional plane. We propose our approximation algorithm for MCDS construction in 3-dimensional wireless network in this paper. It achieves better upper bound (13+ln 10)opt+1 than the only known result 22opt. This algorithm helps bringing the research for MCDS construction in 3-dimensional wireless network to a new stage.
منابع مشابه
ساخت توپولوژی انرژیآگاه با مکانیزم نگهداری در شبکههای حسگر بیسیم
Wireless sensor networks (WSN) is presented solution for the problem of low-cost and flexible monitoring event, especially in places with limited access or dangerous for humans. Wireless sensor networks are built from wireless devices with limited resources thus to Long-Term survival of the Network must use energy-efficient mechanisms, algorithms and protocols. one of th...
متن کاملConstruction of strongly connected dominating sets in asymmetric multihop wireless networks
Consider an asymmetric wireless network represented by a digraph G = (V , E). A subset of vertices U is called a strongly connected dominating set (SCDS) if the subgraph induced by U is strongly connected and every vertex not in U has both an in-neighbor in U and an out-neighbor in U . SCDS plays an important role of the virtual backbone in asymmetric wireless networks. Motivated by the constru...
متن کاملConstruction of minimum connected dominating set in wireless sensor networks using pseudo dominating set
In a wireless network, messages need to be sent on in an optimized way to preserve the energy of the network. A minimum connected dominating set (MCDS) offers an optimized way of sending messages. However, MCDS construction is a NP-Hard problem. In this paper, we propose a new degree-based greedy approximation algorithm named as Connected Pseudo Dominating Set Using 2 Hop Information (CPDS2HI),...
متن کاملAn improved energy Minimum Connected Dominating Sets Construction Algorithm in MANET
In recent years,MANET gain a significant attention for the potential application in battlefield, disaster relief, traffic monitoring and environment monitoring. Construction and maintain of virtual backbone, and energy effective routing in mobile ad hoc wireless network come to be the basic and main problem in MANET. This paper proposed the efficient ENMCDS algorithm for constructing the minimu...
متن کاملOn connected domination in unit ball graphs
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each vertex outside D has at least one neighbor in D. Approximations of minimum connected dominating sets are often used to represent a virtual routing backbone in wireless networks. This paper first proposes a constant-ratio...
متن کامل